Ju n 20 02 Functions with Pick matrices having bounded number of negative eigenvalues
نویسندگان
چکیده
A class is studied of complex valued functions defined on the unit disk (with a possible exception of a discrete set) with the property that all their Pick matrices have not more than a prescribed number of negative eigenvalues. Functions in this class, known to appear as pseudomultipliers of the Hardy space, are characterized in several other ways. It turns out that a typical function in the class is meromorphic with a possible modification at a finite number of points, and total number of poles and of points of modification does not exceed the prescribed number of negative eigenvalues. Bounds are given for the number of points that generate Pick matrices that are needed to achieve the requisite number of negative eigenvalues. A result analogous to Hindmarsh's theorem is proved for functions in the class.
منابع مشابه
Nevanlinna–pick Interpolation: Pick Matrices Have Bounded Number of Negative Eigenvalues
The Nevanlinna–Pick interpolation problem is studied in the class of functions defined on the unit disk without a discrete set, with the property that all their Pick matrices have not more than a prescribed number of negative eigenvalues. It is shown, in particular, that the degenerate problem always has a unique solution, not necessarily meromorphic. A related extension problem to a maximal fu...
متن کاملOn Negative Inertia of Pick Matrices Associated with Generalized Schur Functions
It is known [6] that for every function f in the generalized Schur class Sκ and every nonempty open subset Ω of the unit disk D, there exist points z1, . . . , zn ∈ Ω such that the n × n Pick matrix h 1−f(zi)f(zj)∗ 1−ziz̄j in j,i=1 has κ negative eigenvalues. In this paper we discuss existence of an integer n0 such that any Pick matrix based on z1, . . . , zn ∈ Ω with n ≥ n0 has κ negative eigen...
متن کاملHow bad are symmetric Pick matrices?
Let P be a symmetric positive definite Pick matrix of order n. The following facts will be proven here: (a) P is the Gram matrix of a set of rational functions, with respect to a inner product defined in terms of a “generating function” associated to P ; (b) Its condition number is lower-bounded by a function growing exponentially in n; (c) P can be effectively preconditioned by the Pick matrix...
متن کاملNew Improvement in Interpretation of Gravity Gradient Tensor Data Using Eigenvalues and Invariants: An Application to Blatchford Lake, Northern Canada
Recently, interpretation of causative sources using components of the gravity gradient tensor (GGT) has had a rapid progress. Assuming N as the structural index, components of the gravity vector and gravity gradient tensor have a homogeneity degree of -N and - (N+1), respectively. In this paper, it is shown that the eigenvalues, the first and the second rotational invariants of the GGT (I1 and ...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002